class Solution:
def checkForSame(self, a, b):
count_a = 0
count_b = 0
for i in range(len(a)):
if a[i]>0:
count_a+=1
if b[i]>0:
count_b+=1
return count_a == count_b
def numSplits(self, s: str) -> int:
a = [0] * 27
b = [0] * 27
ans= 0
for i in range(len(s)):
a[ord(s[i]) - 97]+=1
for i in range(len(s)):
ind = ord(s[i]) - 97
a[ind] -=1
b[ind]+=1
if self.checkForSame(a, b):
ans+=1
return ans
1598B - Groups | 1602B - Divine Array |
1594B - Special Numbers | 1614A - Divan and a Store |
2085. Count Common Words With One Occurrence | 2089. Find Target Indices After Sorting Array |
2090. K Radius Subarray Averages | 2091. Removing Minimum and Maximum From Array |
6. Zigzag Conversion | 1612B - Special Permutation |
1481. Least Number of Unique Integers after K Removals | 1035. Uncrossed Lines |
328. Odd Even Linked List | 1219. Path with Maximum Gold |
1268. Search Suggestions System | 841. Keys and Rooms |
152. Maximum Product Subarray | 337. House Robber III |
869. Reordered Power of 2 | 1593C - Save More Mice |
1217. Minimum Cost to Move Chips to The Same Position | 347. Top K Frequent Elements |
1503. Last Moment Before All Ants Fall Out of a Plank | 430. Flatten a Multilevel Doubly Linked List |
1290. Convert Binary Number in a Linked List to Integer | 1525. Number of Good Ways to Split a String |
72. Edit Distance | 563. Binary Tree Tilt |
1306. Jump Game III | 236. Lowest Common Ancestor of a Binary Tree |